TweetFollow Us on Twitter

Oct 00 Getting Started

Volume Number: 16 (2000)
Issue Number: 10
Column Tag: Getting Started - Networking

Networks 201 pt. 4

by John C. Welch

Layer 2: The Data Link Layer


Before we start with this month's installment of our look at networks, an apology/error fix. In the last article, we stated that to find the wavelength of signal, you would invert the frequency, via the equation 1/freq. Unfortunately, that was incorrect. That equation actually gives you the period of the signal. To get the wavelength, you would more correctly use the equation c/freq, where c represents the speed of light in meters per second. Many thanks to Bruce Toback who was the first to notify us as to the error, and all the other readers who caught it as well. Now on to Layer 2.

Going back to the overview of the OSI model in the first article in the series, Layer 2 is the DataLink Layer, and communicates with Layers 1 and 3. The most basic description of Layer 2's function would be that it receives data and routing information from Layer 3, and assembles them into frames which are passed onto the Layer 1. It also receives serial bitstreams from the Layer 1, and assembles these into frames, which are then passed onto Layer 3. Like most networking functions, the actual duties of this Layer are far more complex, and it is those duties, and the complexity therein that we will look at in this article.

Layer 2

Base Function

The basic function of the Data Link Layer is to provide services to the Network Layer. This centers around getting data from the transmitting machine to the receiving machine intact. There are three base methods for doing this:

  1. Unacknowledged Connectionless Service
  2. Acknowledged Connectionless Service
  3. Acknowledged Connection - Oriented Service

The first method, unacknowledged connectionless service, is where the source sends independent frames to the source. This has some analogies to messages in a bottle. You write the message, pop it in the bottle, and set the bottle in the water. It either gets there, or does not. You have no way to verify that it was successfully received, or that, in the case of multiple messages, that they were received in the proper order. This method may sound very unreliable, but in fact it is used quite often. If the protocol you are using, such as TCP, has provisions for connection management, message reassembly, and acknowledgement at a higher layer, then there is no sense in having an additional level of acknowledgement and connection management in the Data Link Layer. As a result, most LANs use this type of service at the Data Link Layer level. The other reason for using this service would be in real time situations, where the time delays in setting up connections and retransmitting data would cause delays that would impede the function of the real time applications.

The second type of service is acknowledged connectionless service. This is analogous to registered mail with a delivery receipt. You have no idea how the mail got to its destination, but you know that it was received or not. There are two ways to deal with acknowledgement errors. The first is to retransmit the entire set of data. While safer in theory, this is impractical for a number of reasons. The first is that if we are talking about a large amount of data, retransmitting the entire data set can take an unacceptably long time, especially over slow links. The other is that considering the chances of a lost packet here and there get very high, especially over unreliable links, so in theory, you could run into a situation where you would never be able to stop retransmitting your data set. The second, and more common method is to only retransmit those frames that were lost. This method requires more sophisticated checking algorithms, but has a greater efficiency than retransmitting the entire message for every error. While lost frames are not a great issue with reliable media, such as fiber, when we talk about wireless networking, the chances for lost frames are much greater, and in fact, this is the type of service used in the 802.11b wireless networking standard. It is worth noting that providing acknowledgements at the Data Link Layer level is an optimization, not a requirement. That function can be, and often is handled at higher levels.

The final type of service is acknowledged connection - oriented service. In this class of service, a connection is created before any data is transmitted, each frame sent over the connection is numbered, and each frame sent is guaranteed to be received. In addition, each frame sent is guaranteed to be received only once, and in the correct order. This type of service creates, what is essentially a networked bit stream. There are three phases to data transfers in this service. The first is the establishment of a connection. As part of this, frame counters are created on both sides, to keep track of which frames have and have not been sent. The second phase is the actual transmitting of data, and the tracking of the frames. The final phase is the connection teardown, and the disposal of the frame counters and other resources used.

It worth mentioning here, that as far as the Data Link Layer is concerned, the Physical Layer doesn't really exist. Although the physical path of the data has to travel through the Physical Layer, the logical path at the Layer 2 level would show an end - to - end connection between Layer 2 on the transmitter, and Layer 2 on the receiver. There are a number of reasons for this, including error correction, data delivery mechanisms, etc. The important thing to remember is that for Layer 2, Layer 1 doesn't really exist


As we mentioned earlier, the Data Link Layer deals with frames. This is the way it both provides service to the Network Layer, and uses the services provided by the Physical Layer. Remember, all the Physical Layer cares about is getting bits from the Network Layer, and shoving them out onto the line to their destination. (Actually, all the Physical Layer cares about is shoving bits onto and receiving bits from the wire. It has nothing to do with addressing, and in the case of things like Ethernet, will actually look at all bits on the wire, relying on the higher layers to check things like destination addressing.)

In any case, the structure used by the Data Link Layer is the frame. All data from the Network Layer is encapsulated into a frame, and sent on to the Physical Layer. Conversely, all bits from the Physical Layer is packed into frames, and sent on to the Network Layer. Although the specific sizes and contents of frames are determined by the hardware protocol used, such as Ethernet and Token Ring, all frames have certain structural commonalities.

All frames have a Start Of Frame delimiter of some kind. This is some kind of structure that says "This is where the frame starts". They also all have some kind of End Of Frame delimiter, or Frame Check Sequence, that says "This is where the frame ends." Since we are talking about the start and end of frame delimiters, this is a good time to touch on exactly how frames are pulled out of bits on a wire. There are about five ways to do this. The first, timing, is not used, and was never really used, as there is almost no way for any network to guarantee the timing between frames, or how long a frame takes to get from point a to point b. This leaves us with four other methods of marking frames:

  1. Character Count
  2. Starting and ending characters, with character stuffing
  3. Starting and ending flags, with bit stuffing.
  4. Physical Layer coding violations

Method one, character count, uses a header to specify the number of characters in a frame. When the Data Link Layer sees this header, it knows the end of the frame is exactly X number of characters follow the character count header, and therefore, where the frame ends. The problem with this is that there is no real way to deal with the character count getting scrambled. If the transmitter sends a count of 25 characters, and the data gets scrambled, so that the receiver sees a count of 20 characters, then not only is that frame garbled, but all following frames as well. Once this synchronization is lost, then even retransmission doesn't work, because there is no way to tell how many characters to ignore so as to skip the bad frame. Not surprisingly, the character count method is rarely used these days.

The second method uses specific characters to specify the beginning and the end of the frame structure. The characters used are ASCII character pairs, with DLE STX used for the frame start, and DLE ETX used for the frame finish. (DLE stands for Data Link Escape, STX stands for Start of TeXt, and ETX stands for End of TeXt.) By using specific character sets as frame delimiters, and using those specific character pairs solely as frame delimiters, the character count synchronization issues are avoided. This works well for text data, but if we are dealing with binary or numerical data, then it is possible for those characters to occur in random places within the frame. The way to avoid this problem is to have the Data Link Layer insert, or 'stuff', and extra DLE character in front of each occurrence of a delimiter pair in the wrong place. This way, the Data Link Layer on the receiving end knows that a double DLE pair is not a frame delimiter, and to remove one of the DLE characters from the frame data before passing the frame up to the Network Layer. Although this character stuffing works reasonably well, this entire method is too closely tied to eight - bit ASCII data to be useful universally.

The third method, uses bit pattern flags instead of character pairs as frame delimiters. This flag pattern is generally 01111110. To avoid synchronization errors caused by that pattern occurring naturally, every time there is a series of five consecutive 1 bits, a 0 bit is inserted immediately after the fifth 1. This way, the flag pattern is never duplicated in the frame data, avoiding synchronization errors. As well, this method is not tied to any particular encoding method, so it can be used more universally.

The final method is used in LAN types where the data is encoded using bit pairs, i.e. a 01 pair is used to represent a binary 0, and a 10 is used to represent a binary 1. The transition from high to low, or vice-versa is what determines the data type. This makes it easy to take advantage of this to set frame boundaries. Since all data is a transition of some type, the pairs 00 and/or 11 can be used to set frame boundaries, as they will never occur anywhere else. Obviously, this method can only be used on networks with the proper type of bit encoding. In general, a combination of methods are used to delimit frames, so as to lessen the chance of error.

In addition to the delimiters, all frames have source and destination address pairs. These are the hardware identifiers that name both the source and destination machines of the frame. The address pairs are placed at the beginning of the frame, so that they can be processed faster by a potential destination machine.

The final common part of frame structure is the data field. This is the area that carries the actual data for the frame. The length of this is dependent on the hardware protocol used, such as Ethernet, Token Ring, FDDI, ATM, etc.

Error Control

Since we are sending frames back and forth, we need to make sure that what we send is what we receive, which leads us to another job of the Data Link Layer, error control. There are a number of areas in which the Data Link Layer provides this service. The first is in the area of frame delivery. When a frame is transmitted, it is good to know that the frame arrived at all, and if so, that it arrived intact. There are two ways that the Data Link Layer handles this. When a frame is sent, and received successfully, the receiver sends back a special control frame whose purpose is to acknowledge the successful reception of the frame. This is commonly called an ACK frame, or just ACK. If the frame was not received successfully, then a negative acknowledgement, or NACK frame is sent. (it is useful to point out here that the ACK/NACK do not indicate the data in the frame is intact, but rather that the frame itself was received correctly. The Data Link Layer does provide error detection for the data in the frame, we will cover that later. It is also good to note that the error correction capabilities of the Data Link Layer are optional in a protocol, and can be not used if this service is provided higher up.) This is useful when the frame is received, but what if the frame disappears completely? To handle this, timers are used. As each frame is sent, a timer is started. If the timer reaches its end before the ACK or NACK is received, then the frame is retransmitted. To avoid the receiver passing the same frame up to the Network Layer multiple times, a sequence number is assigned to each frame, so that the receiver can distinguish retransmissions from original frames.

In addition to the basic frame structure, the Data Link Layer can actually check to ensure that the physical bits in the frame at the receiving end are the exact same bits that were transmitted. There are two general ways to do this. The first is to send enough information along with the packet so that the receiver can figure out what the garbled character must have been. This procedure uses error-correcting codes. The second is to allow the receiver to deduce that an error occurred, but not what error or where, and request a retransmission of the frame. This method uses error-detection codes.

In error correction, the data is analyzed, and any errors are able to be fixed. The methods we will cover here are based upon the work of Hamming. In comparing two binary words, such as 10001001 and 10110001, it is relatively easy to determine which bits differ, by Exclusive ORing, or XOR'ing the words. (When two digits are compared via XOR, the result shows if the digits were alike or not. So 1 XOR 1 would give you a 0 as a result, since 1 and 1 are the same, whereas a 1 XOR 0 would give you a 1 as a result, since 1 and 0 are different.) In the case of our words, there are 3 bits that differ, so they are said to have a Hamming distance of 3. To help detect and fix errors, check bits are used. These are bits within the word that, instead of containing data, are used to protect the integrity of the data. This means that if you are sending eight - bit data words, that instead of their being 28 possible combinations of data, there will be fewer, as the check bits will take up space within that eight - bit word.

As an example, we take an eight bit word, and number each bit starting at the left with bit 1. Each bit that is a power of 2, (1,2,4,8), becomes a check bit, and the remaining bits are used to hold the data. The check bit is used to force the parity of a collection of bits, including itself to be even or odd. A given check bit can be used in multiple calculations. For example, the bit at position 7 is checked by bits 1, 2, and 4, (1+2+4 = 7). So when the word arrives at the receiver, the parity of each check bit is examined, (usually, 0 indicates even and 1 indicates odd.) If the parity of each check bit is correct, then the parity counter is not incremented. If the parity is incorrect, then the counter is incremented by the position of that bit. So, if bits 1,2,and 4 are incorrect, then the counter would read 7, and that would be the bit that is inverted. This allows the receiver to set bit 7 to its proper value. In general, Hamming codes can only detect single errors. However, by arranging the words as an array, and sending the words out column-wise, instead of row-wise, the Hamming codes can then be used to correct any error in that array.

With error detection, the data is analyzed for correctness, but if an error is found, then the frame is retransmitted, rather than being fixed. One of the most common ways of doing this is via a Cyclic Redundancy Code, or CRC. In this case, the word is treated as a polynomial of k terms, with coefficients of 1 or 0 only. As an example, 11100011 would be an eight-term polynomial with coefficients of 1,1,1,0,0,0,1,1, being the equivalent of x7+x6+x5+x1+x0. Within CRC, polynomial division is used to create the CRC code. The first part is to agree on a generator polynomial, G(x) in advance. Both the high and low order bits of G(x) must be 1. To compute the checksum of a frame with m bits, corresponding to a polynomial M(x), the frame must be longer than G(x). The idea here is to append a checksum onto the end of the frame in such a way that the polynomial represented by the checksummed frame is evenly divisible by G(x). If there is a remainder after this division, the data is garbled somehow. The algorithm for this follows.

  1. Let r be the degree of G(x). Append r 0's to the end of the frame so that it contains m + r bits, and corresponds to the polynomial XrM(x).
       Frame:       1101011011
       G(x):      10011
       XrM(x):      11010110110000
  2. Divide G(x) into XrM(x) using Modulo 2 division
  3. If there is a remainder, subtract that from XrM(x) using Modulo 2 subtraction. The result is the checksummed frame to be transmitted, or T(x). In our example, we would have a remainder of 1110. Subtracting 1110 from 11010110110000 via Modulo 2 subtraction, (which is simply subtraction via XOR) gives us a T(x) of 11010110111110.

The ability of the CRC method to detect errors is extremely high. As an example, if 16 - bit CRC is used, then all single or double bit errors are caught, all odd-numbered errors, all burst errors of length 16 or less, 99.997% of 17 - bit error bursts, and 99.998% of all 18 - bit or longer bursts.

Regardless of which method is used, both error correction and error detection both work well to help insure reliable data delivery across networks.

Media Access Control

The final job of the Data Link Layer is to handle access to the media itself. In most LANs, there are four basic methods for handling media access control:

  1. Contention
  2. Token Passing
  3. Demand-priority
  4. Switched

The first method, contention is the most widely used for now. This is the method used by such LAN types as Ethernet, Fast Ethernet, and 802.11 wireless networks. While widely used, this is also a fairly primitive form of media access control. Each time any device on a contention network needs to transmit data, it checks the wire to see if any other station is transmitting. If not, then the device can transmit, otherwise, the device must wait for the media to clear up. This type of network also requires that all devices transmit and receive on the same frequency band. The media can only support a single signal at a time, and this signal takes up the entire band. In other words, this is a baseband transmission network. This creates two important implications, the first being that only one device can transmit at a time, and that a device can transmit or receive, but not both at once. This is called a half-duplex operation.

In a contention based network, there are a number of things that are done to avoid collisions, which occur when two stations attempt to transmit at the same time. These are based on frame size and timing. As an example, with the IEEE 802.3 Ethernet, frame sizes are specified to be between 64 and 1524 octets in size. If a frame is going to be smaller than 64 octets, it is padded with 0s so that it is 64 octets in size. The reason for this ties into the timing part of collision avoidance, timing. If the minimum and maximum frame sizes are known, consistent quantities, then the amount of time it should take a frame to reach its destination can be accurately calculated. This time is the time it would take for each frame to propagate across the entire network. In a contention-based, baseband transmission network, each frame must be sent over the entire LAN to ensure than all recipients can receive it. In any case, the frame can be destroyed by a collision anywhere on the network. As the physical size, and number of devices on the network grow, the probability of collisions increase. One of the ways that modern networks avoid collisions is by using an inter-frame gap. This is a specified amount of dead air between frames. In a modern Ethernet network, the inter-frame gap is 96 bits long. So when a device transmits, not only must other devices wait for the frame to be transmitted, but also for the inter-frame gap to be transmitted. This gives the transmitting device time to either send another frame, or relinquish control of the media, without contending with all the other devices on the LAN.

Another method is through the Binary Exponential Backoff Algorithm. This is used after a collision occurs. After a collision, time is divided into discrete slots, which are this size of the time it takes a frame to travel round trip on the longest path allowed by the network type. In the case of 802.3 Ethernet, this is 51.2µsec. After the first collision, the stations that were affected wait either 0, or 1 of these time slots before trying again. If they collide again, they pick 0 - 3 time slots, wait, and try again. If a collision occurs again, then 0-7 time slots are used. In each case, this is a binary value, using 21 slots for the first collision, 22 for the second, 23 for the third and so on, hence the name of the algorithm. This occurs up to a maximum of 210 slots. Once that number of slots has been reached, then the stations wait a fixed amount of time. If 16 consecutive collisions occur at this point, the controller gives up, and reports a failure back to the computer. Further recovery is then up to higher layers.

Although collisions have a bad name, and rightfully so, they can be successfully managed through proper use of network design and devices, as well as using different types of network protocols in the areas where they are strongest.

The next type of media access control is via a token passing mechanism, used most often in Token Ring and FDDI networks. A token is a special frame that moves from device to device on the ring, (token - based networks use some sort of ring shape for their function.), and only circulates when the network is idle. The frame is only a few octets in length, and contains a special bit pattern. If a device needs to transmit data, it 'captures' the token, and converts that bit pattern into a Start Of Frame, (SOF) delimiter, that informs downstream devices that this is now a data - bearing frame, and that they have to wait until they get a token before they can transmit. The token is the sole way to access the network in this type of media access control. If a device receives the token, it has up to the default value in milliseconds for that network to convert the token into a data frame. If it does not have any data, it must release the token to the next device in the ring. If it does have data, then it converts the frame to a data frame, and begins transmitting. The recipient of the data then modifies the frame to show an ACK or NACK. Once the data transmittal is complete, the originating station converts the frame back to a token, and sends it back onto the network. The advantages to a token - passing network are highest in situations where a predictable delay in data transmittance is needed.

The obvious problem with a token-passing network is that of how to deal with the situation that arises when a transmitting station goes down, or drops off the ring. Without a method of dealing with this, the entire network could stop functioning, as there would be no way to convert the data frame back to a token frame. To handle this, the idea of a monitor station was provided. The monitor station monitors the ring, and ensures that the ring does not exceed a given time without the existence of a token. In the case we described above, the monitor, (which is usually the first station on the ring, or if that station goes down, a monitor contention algorithm decides the new monitor station.) grabs the data frame, removes it from the ring, or drains it, and issues a new token. By using monitor stations, we avoid having an orphan frame endlessly circulating, and preventing any other station from transmitting.

The third media access control method is that of Demand Priority Access Method, or DPAM. DPAM is a round - robin arbitration method wherein a central repeater, or hub, polls each port connected to it. This is done in port order, and identifies the ports with transmission requests. Once the ports that need to transmit are identified, then the priority of those ports is established. Normally, and idle port transmits an idle signal, indicating that it is not transmitting data. If a given port is cleared to transmit data, the hub tells it to cease transmission of the idle signal. When the port hears its own 'silence', it begins to transmit data. Once data transmission begins, the hub alerts all ports connected to it that they may be receiving data. The hub then analyzes the destination address in the frame, compares it to its own internal link configuration table, and routes the frame to the port that connects to the specified device.

In a DPAM network, the priority is controlled by the central, or root hub. The overall priority for the network is also called the priority domain. This domain can include up to three levels of cascaded hubs. The central hub sends all traffic to the lower level hubs, which handle polling their own active ports once transmission has ceased. By using a priority mechanism, the problems of contention are avoided. No station can transmit twice in a row if other stations with equal, or higher priority requests are pending. If a station is transmitting, a station with a higher priority cannot interrupt that transmission. A higher priority request can however, preempt a lower level one. Finally, any lower level request that has waited for longer than 250ms is automatically raised to higher priority status. Although more reliable than contention networks, and cheaper than token - passing networks, DPAM was never a marketplace contender, and is virtually nonexistent in the modern LAN.

The final media access control method, switching, isn't as clearly defined as the other three, but is being used more and more in modern LANs to increase performance and efficiency. In essence, a switch decreases the network size for a given transmission to 3 devices: the switch, the transmitter, and the receiver. This increases performance by giving the data transmission the full bandwidth of the network for that transmission by creating a virtual network just for that transmission. It increases efficiency by decreasing the number of collisions on a contention network, and by allowing the use of the full bandwidth of the network. Switching has also allowed the use of the VLAN, or virtual LAN, where traffic can be segregated by protocol, port number, hardware address, etc. This also decreases the overall amount of traffic on the LAN, which decreases the error rate on the LAN. Switching can also be used by token-passing networks as well.


Well, we covered a lot for one layer, and really barely scratched the surface of Layer 2. There are whole books available that deal with this Layer alone, as it is one of the most complex layers in the OSI model, and one of the most critical. Hopefully, you now have a better idea of how this layer works, and why it is as important as it is. As usual, you are encouraged to read up on your own, the sources I list in my bibliography are a good start. Next time, Layer 3, the Network Layer!

Bibliography and References

  • Tannenbaum, Andrew S. Computer Networks. Third Edition Prentice Hall, 1996.
  • Sportack, Mark. Networking Essentials Unleashed. SAMS Publishing, 1998.

John Welch <> is the Mac and PC Administrator for AER Inc., a weather and atmospheric science company in Cambridge, Mass. He has over fifteen years of experience at making computers work. His specialties are figuring out ways to make the Mac do what nobody thinks it can, and showing that the Mac is the superior administrative platform.


Community Search:
MacTech Search:

Software Updates via MacUpdate

Hopper Disassembler 4.3.10- - Binary dis...
Hopper Disassembler is a binary disassembler, decompiler, and debugger for 32- and 64-bit executables. It will let you disassemble any binary you want, and provide you all the information about its... Read more
Paparazzi! 1.0b7 - Make user-defined siz...
Paparazzi! is a small utility for OS X that makes screenshots of webpages. This very simple tool takes screenshots of websites which do not fit on one screen. You specify the desired width, minimal... Read more
Amadeus Pro 2.4.4 - Multitrack sound rec...
Amadeus Pro lets you use your Mac for any audio-related task, such as live audio recording, digitizing tapes and records, converting between a variety of sound formats, etc. Thanks to its outstanding... Read more
Google Chrome 63.0.3239.108 - Modern and...
Google Chrome is a Web browser by Google, created to be a modern platform for Web pages and applications. It utilizes very fast loading of Web pages and has a V8 engine, which is a custom built... Read more
Apple Configurator 2.6 - Configure and d...
Apple Configurator makes it easy to deploy iPad, iPhone, iPod touch, and Apple TV devices in your school or business. Use Apple Configurator to quickly configure large numbers of devices connected to... Read more
WhatRoute 2.0.26 - Geographically trace...
WhatRoute is designed to find the names of all the routers an IP packet passes through on its way from your Mac to a destination host. It also measures the round-trip time from your Mac to the router... Read more
Remotix 5.0.4 - Access all your computer...
Remotix is a fast and powerful application to easily access multiple Macs (and PCs) from your own Mac. Features Complete Apple Screen Sharing support - including Mac OS X login, clipboard... Read more
WhatRoute 2.0.26 - Geographically trace...
WhatRoute is designed to find the names of all the routers an IP packet passes through on its way from your Mac to a destination host. It also measures the round-trip time from your Mac to the router... Read more
Google Chrome 63.0.3239.108 - Modern and...
Google Chrome is a Web browser by Google, created to be a modern platform for Web pages and applications. It utilizes very fast loading of Web pages and has a V8 engine, which is a custom built... Read more
Paparazzi! 1.0b7 - Make user-defined siz...
Paparazzi! is a small utility for OS X that makes screenshots of webpages. This very simple tool takes screenshots of websites which do not fit on one screen. You specify the desired width, minimal... Read more

Latest Forum Discussions

See All

WWE Mayhem guide - beginner tips and tri...
WWE Mayhem brings all of the familiar faces from your favorite wrestling league to mobile in this exciting new fighting game. Build up a team of your favorite WWE superstars and fight your way to the championship title, or battle against your... | Read more »
The best new games we played this week -...
We've made it through another week, so let's treat ourselves to some of the best new games to launch in the past few days. It was another exciting week with some long-awaited indie games making their debut, and some big console titles making the... | Read more »
Match blocks to pull off dance moves in...
Ferdinand: Unstoppabull is a brand new match three puzzler based on the animated movie of (almost) the same name. As you can expect, you have to match blocks together to complete a bunch of puzzling levels and earn a high score. [Read more] | Read more »
Lineage 2: Revolution’s end of year upda...
Now available in 54 countries worldwide, Lineage 2: Revolution is continuing its global quest to be the most popular mobile MMORPG by launching a jam-packed end of year update. Complete with many subtle tweaks to help improve users’ online... | Read more »
The 5 best Star Wars games on iOS
The time has almost come.Star Wars: The Last Jedifinally hits theaters in the cinematic event that might be bigger than Christmas. To celebrate, we're taking a look at the best--and only the best--Star Warsmobile games to date. [Read more] | Read more »
Life Is Strange (Games)
Life Is Strange 1.1 Device: iOS Universal Category: Games Price: $2.99, Version: 1.1 (iTunes) Description: Life Is Strange is a five part episodic game that sets out to revolutionize story-based choice and consequence games by... | Read more »
Oddworld: New 'n' Tasty (Game...
Oddworld: New 'n' Tasty 1.0 Device: iOS Universal Category: Games Price: $7.99, Version: 1.0 (iTunes) Description: ** PLEASE NOTE: Requires 3.6GB free space to install. Runs at variable resolutions based on device capabilities.... | Read more »
Gorogoa (Games)
Gorogoa 1.0 Device: iOS Universal Category: Games Price: $4.99, Version: 1.0 (iTunes) Description: Gorogoa is an elegant evolution of the puzzle genre, told through a beautifully hand-drawn story designed and illustrated by Jason... | Read more »
Why Guns of Boom will be big for mobile...
Earlier this week, Game Insight, the minds that brought you Guns of Boom, revealed plans for an esports mode in the popular FPS title, with big implications for the game's future. Guns of Boom has been quite popular for some time now, so it's... | Read more »
The best mobile games to play on lazy ho...
With the holidays in full swing, there's hopefully going to be a lot of time off work lazing around the house. With all of that free time, it's a perfect opportunity to catch up on some mobile games that you might have missed out on earlier this... | Read more »

Price Scanner via

The lowest prices on Apple 13″ MacBook Pros t...
Save $300-$300 on the purchase of a 2017 13″ MacBook Pro this weekend with Certified Refurbished models at Apple. In many cases, Apple’s refurbished prices are the lowest available for each model... Read more
Lowest prices of the Holiday season: 15″ Appl...
Save $360-$420 on the purchase of a 2017 15″ MacBook Pro with Certified Refurbished models at Apple. In many cases, Apple’s refurbished prices are the lowest available for each model from any... Read more
Apple discounts Beats products by up to 30% t...
Apple has Beats by Dr. Dre (BeatsX, Powerbeats3 Wireless, and Beats Solo3 Wireless) on sale for up to 30% off their retail price from now until December 26th: – BeatsX: Was $149.95, now $99 –... Read more
Updated Price Trackers: Macs, iPads, iPhones,...
Scan our Apple Price Trackers for the latest information on sales, bundles, and availability on systems from Apple’s authorized internet/catalog resellers. We update the trackers continuously: – 15″... Read more
How to preorder a new iMac Pro and pay zero s...
B&H Photo and Adorama are accepting preorders on multiple configurations of the new Apple iMac Pro. Both resellers charge sales tax for residents of NY & NJ only, and shipping is free.... Read more
Apple Macs back in stock at Amazon with model...
Amazon has MacBook Pros, MacBook Airs, MacBooks, and iMacs on sale for up to $200 off MSRP as part of their Holiday/Christmas sale. Shipping is free. Note that stock of some Macs may come and go (and... Read more
Apple offering free overnight delivery on all...
Apple is now offering free overnight delivery on all in stock products until 3pm local time on December 22nd. This includes new as well as refurbished computers. Click here for more information. Read more
Beats Holiday sale at B&H, headphones and...
B&H Photo has Beats by Dr. Dre headphones, earphones, and speakers on sale for up to $80 off MSRP as part of their Holiday sale. Expedited shipping is free, and B&H charges sales tax to NY... Read more
Holiday sale: Apple resellers offer 2017 15″...
MacMall has 15″ MacBook Pros on sale for $220-$300 off MSRP, each including free shipping: – 15″ 2.8GHz MacBook Pro Space Gray (MPTR2LL/A): $2179, $220 off MSRP – 15″ 2.8GHz MacBook Pro Silver (... Read more
Holiday sale: Apple resellers offer 13″ MacBo...
B&H Photo has 13″ MacBook Pros on sale for up to $150 off MSRP. Shipping is free, and B&H charges sales tax for NY & NJ residents only: – 13-inch 2.3GHz/128GB Space Gray MacBook Pro (... Read more

Jobs Board

*Apple* Retail - Multiple Positions - Apple,...
Job Description: Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
*Apple* Retail - Multiple Positions - Apple,...
Job Description:SalesSpecialist - Retail Customer Service and SalesTransform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
*Apple* Retail - Multiple Positions - Apple,...
Job Description: Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
Payments Counsel, *Apple* Pay (payments, cr...
# Payments Counsel, Apple Pay (payments, credit/debit) Job Number: 112941729 Santa Clara Valley, California, United States Posted: 13-Dec-2017 Weekly Hours: 40.00 Read more
*Apple* Solutions Consultant - Apple (United...
# Apple Solutions Consultant Job Number: 113124408 Waterford, CT, Connecticut, United States Posted: 17-Oct-2017 Weekly Hours: 40.00 **Job Summary** Are you Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.